Combinatorial algorithms for the maximum k-plex problem
نویسندگان
چکیده
منابع مشابه
Combinatorial algorithms for the maximum k-plex problem
The maximum clique problem provides a classic framework for detecting cohesive subgraphs. However, this approach can fail to detect much of the cohesive structure in a graph. To address this issue, Seidman and Foster introduced k-plexes as a degree-based relaxation of graph completeness. More recently, Balasundaram et al. formulated the maximum k-plex problem as an integer program and designed ...
متن کاملModeling the maximum edge-weight k-plex partitioning problem
Given a sparse undirected graph G with weights on the edges, a k-plex partition of G is a partition of its set of nodes such that each component is a k-plex. A subset of nodes S is a k-plex if the degree of every node in the associated induced subgraph is at least |S| k. The maximum edge-weight k-plex partitioning (Max-EkPP) problem is to find a k-plex partition with maximum total weight, whe...
متن کاملExact combinatorial algorithms and experiments for finding maximum k-plexes
We propose new practical algorithms to find maximum-cardinality k-plexes in graphs. A k-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most k vertices in the k-plex. Cliques are 1plexes. In analogy to the special case of finding maximum-cardinality cliques, finding maximum-cardinality k-plexes is NP-hard. Complementing previous work, we de...
متن کاملFrequency-driven tabu search for the maximum s-plex problem
The maximum s-plex problem is an important model for social network analysis and other studies. In this study, we present an effective frequency-driven multineighborhood tabu search algorithm (FD-TS) to solve the problem on very large networks. The proposed FD-TS algorithm relies on two transformation operators (Add and Swap) to locate high-quality solutions, and a frequency-driven perturbation...
متن کاملImproved Algorithms for the K-Maximum Subarray Problem
Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, Bengtsson and Chen presented OðminfK + n logn‚ n ffiffiffiffi K p gÞ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2010
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-010-9338-2